ADD-OPT: Accelerated Distributed Directed Optimization
نویسندگان
چکیده
منابع مشابه
Accelerated Shift-and-Add Algorithms
The problem addressed in this paper is the computation of elementary functions (exponential, logarithm, trigonometric functions, hyperbolic functions and their reciprocals) in fixed precision, typically the computer single or double precision.The method proposed here combines Shift-and-Add algorithms and classical methods for the numerical integration of ODEs: it consists in performing the Shif...
متن کاملResolution-Directed Optimization-based Distributed Sensing
In this paper we study the problem of optimal zone coverage, using distributed sensing, i.e. a group of collaborating sensors. We formulate the problem as an optimization problem with timevarying cost function. We examine the case where a group of elevated imaging sensors look down to and form the map of a 2-dimensional environment at a pre-specified resolution. The sensors solve an optimizatio...
متن کاملP-OPT: Program-Directed Optimal Cache Management
As the amount of on-chip cache increases as a result of Moore’s law, cache utilization is increasingly important as the number of processor cores multiply and the contention for memory bandwidth becomes more severe. Optimal cache management requires knowing the future access sequence and being able to communicate this information to hardware. The paper addresses the communication problem with t...
متن کاملAn accelerated optimization algorithm for distributed model predictive control ⋆
We regard a network of systems with coupled dynamics or constraints that we want to control optimally. The cost function is assumed to be separable and convex. We show that the corresponding centralized model predictive control (MPC) problem can be recast as a separable convex optimization problem. Furthermore, we present a dual-based decomposition method, called here the proximal center method...
متن کاملOn the linear convergence of distributed optimization over directed graphs
This paper develops a fast distributed algorithm, termed DEXTRA, to solve the optimization problem when n agents reach agreement and collaboratively minimize the sum of their local objective functions over the network, where the communication between the agents is described by a directed graph. Existing algorithms solve the problem restricted to directed graphs with convergence rates of O(ln k/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2018
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2017.2737582